A Methodology for Classifying Search Operators as Intensification or Diversification Heuristics

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Path-relinking Intensification Algorithms for Stochastic Local Search Heuristics

Path-relinking is major enhancement to heuristic search methods for solving combinatorial optimization problems, leading to significant improvements in both solution quality and running times. We review its fundamentals and implementation strategies, as well as advanced hybridizations with more elaborate metaheuristic schemes such as genetic algorithms and scatter search. Numerical examples are...

متن کامل

Probabilistic diversification and intensification in local search for vehicle routing

This paper presents a probabilistic technique to diversify, intensify and parallelize a local search adapted for solving vehicle routing problems. This technique may be applied to a very wide variety of vehicle routing problems and local searches. It is shown that efficient first level taboo searches for vehicle routing problems may be significantly improved with this technique. Moreover, the s...

متن کامل

A Switching Criterion for Intensification and Diversification in Local Search for SAT

We propose a new switching criterion, namely the evenness or unevenness of the distribution of variable weights, and use this criterion to combine intensification and diversification in local search for SAT. We refer to the ways in which state-of-the-art local search algorithms adaptG2WSATP and VW select a variable to flip, as heuristic adaptG 2WSATP and heuristic VW , respectively. To evaluate...

متن کامل

Static Types As Search Heuristics

Static analysis techniques have been studied for many years in the functional programming community, most prominently the use of inferred types to eliminate run-time checks. In analogy, if we regard checking whether an instance is useful for a proof as run-time checks and we can find types that eliminate irrelevant instances, we may also be able to prevent proof searches from checking those irr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Complexity

سال: 2020

ISSN: 1076-2787,1099-0526

DOI: 10.1155/2020/2871835